Discrete piecewise monotonic approximation by a strictly convex distance function
نویسندگان
چکیده
منابع مشابه
Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
Theory and algorithms are presented for the following smoothing problem. We are given n measurements of a real-valued function that have been altered by random errors caused by the deriving process. For a given integer k , some efficient algorithms are developed that approximate the data by minimizing the sum of strictly convex functions of the errors in such a way that the approximated values ...
متن کاملApproximation by piecewise constants on convex partitions
We show that the saturation order of piecewise constant approximation in Lp norm on convex partitions with N cells is N −2/(d+1), where d is the number of variables. This order is achieved for any f ∈ W 2 p (Ω) on a partition obtained by a simple algorithm involving an anisotropic subdivision of a uniform partition. This improves considerably the approximation order N−1/d achievable on isotropi...
متن کاملOn Signal Restoration by Piecewise Monotonic Data Approximation
We consider the application of the piecewise monotonic data approximation method to some problems that are derived from univariate signal restoration. We present numerical examples in order to show the efficacy of a software package that implements the method in data fitting and in denoising data from a medical image. The piecewise monotonic approximation method makes the smallest change to the...
متن کاملPiecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient access to distance (error) estimates. In this paper we present an algorithm to compute a piecewise linear, not necessarily continuous approximation of the signed distance field for a given object. Our approach is based on...
متن کاملA Characterization Theorem for the Discrete Best Monotonic Approximation Problem
A characterization theorem is derived that motivates a procedure for generating discrete best monotonie approximations to n sequential data values, when a strictly convex objective function is used in the calculation. The procedure is highly useful in the discrete nonlinear optimization calculation that produces the best piecewise monotonie approximations to the data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1995
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1995-1270617-x